0.07/0.13	% Problem    : Vampire---4.8_28359 : TPTP v0.0.0. Released v0.0.0.
0.07/0.14	% Command    : run_E %s %d THM
0.15/0.35	% Computer : n025.cluster.edu
0.15/0.35	% Model    : x86_64 x86_64
0.15/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.35	% Memory   : 8042.1875MB
0.15/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.15/0.35	% CPULimit   : 1440
0.15/0.35	% WCLimit    : 180
0.15/0.35	% DateTime   : Mon Jul  3 13:06:08 EDT 2023
0.15/0.35	% CPUTime    : 
0.22/0.48	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.anEhpCoJ4D/Vampire---4.8_28359
0.22/0.49	# Version: 3.1pre001-ho
0.22/0.50	# Preprocessing class: HSSSSLSSMLMNSFA.
0.22/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.22/0.50	# Starting new_ho_10 with 900s (5) cores
0.22/0.50	# Starting sh5l with 180s (1) cores
0.22/0.50	# Starting new_bool_1 with 180s (1) cores
0.22/0.50	# Starting new_bool_2 with 180s (1) cores
0.22/0.50	# new_ho_10 with pid 28689 completed with status 0
0.22/0.50	# Result found by new_ho_10
0.22/0.50	# Preprocessing class: HSSSSLSSMLMNSFA.
0.22/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.22/0.50	# Starting new_ho_10 with 900s (5) cores
0.22/0.50	# No SInE strategy applied
0.22/0.50	# Search class: HHUSM-FFSF21-MSFSMFBN
0.22/0.50	# Scheduled 5 strats onto 5 cores with 900 seconds (900 total)
0.22/0.50	# Starting new_ho_10 with 541s (1) cores
0.22/0.50	# Starting sh5l with 91s (1) cores
0.22/0.50	# Starting new_bool_1 with 91s (1) cores
0.22/0.50	# Starting new_bool_2 with 91s (1) cores
0.22/0.50	# Starting new_bool_9 with 86s (1) cores
0.22/0.50	# sh5l with pid 28697 completed with status 0
0.22/0.50	# Result found by sh5l
0.22/0.50	# Preprocessing class: HSSSSLSSMLMNSFA.
0.22/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.22/0.50	# Starting new_ho_10 with 900s (5) cores
0.22/0.50	# No SInE strategy applied
0.22/0.50	# Search class: HHUSM-FFSF21-MSFSMFBN
0.22/0.50	# Scheduled 5 strats onto 5 cores with 900 seconds (900 total)
0.22/0.50	# Starting new_ho_10 with 541s (1) cores
0.22/0.50	# Starting sh5l with 91s (1) cores
0.22/0.50	# Preprocessing time       : 0.002 s
0.22/0.50	# Presaturation interreduction done
0.22/0.50	
0.22/0.50	# Proof found!
0.22/0.50	# SZS status Theorem
0.22/0.50	# SZS output start CNFRefutation
0.22/0.50	thf(decl_22, type, in: $i > $i > $o).
0.22/0.50	thf(decl_23, type, emptyset: $i).
0.22/0.50	thf(decl_24, type, setadjoin: $i > $i > $i).
0.22/0.50	thf(decl_25, type, setunion: $i > $i).
0.22/0.50	thf(decl_26, type, dsetconstr: $i > ($i > $o) > $i).
0.22/0.50	thf(decl_27, type, dsetconstrER: $o).
0.22/0.50	thf(decl_28, type, iskpair: $i > $o).
0.22/0.50	thf(decl_29, type, kpair: $i > $i > $i).
0.22/0.50	thf(decl_30, type, kpairp: $o).
0.22/0.50	thf(decl_31, type, singleton: $i > $o).
0.22/0.50	thf(decl_32, type, theprop: $o).
0.22/0.50	thf(decl_33, type, kfst: $i > $i).
0.22/0.50	thf(decl_34, type, setukpairinjR: $o).
0.22/0.50	thf(decl_35, type, ksndsingleton: $o).
0.22/0.50	thf(decl_36, type, ksnd: $i > $i).
0.22/0.50	thf(decl_37, type, esk1_2: $i > $i > $i).
0.22/0.50	thf(decl_38, type, esk2_2: $i > $i > $i).
0.22/0.50	thf(decl_39, type, esk3_1: $i > $i).
0.22/0.50	thf(decl_40, type, esk4_0: $i).
0.22/0.50	thf(decl_41, type, esk5_0: $i).
0.22/0.50	thf(decl_42, type, epred1_1: $i > $i > $o).
0.22/0.50	thf(iskpair, axiom, ((iskpair)=(^[X1:$i]:(?[X3:$i]:(((in @ X3 @ (setunion @ X1))&?[X4:$i]:(((in @ X4 @ (setunion @ X1))&((X1)=(setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X4 @ emptyset)) @ emptyset)))))))))), file('/export/starexec/sandbox/tmp/tmp.anEhpCoJ4D/Vampire---4.8_28359', iskpair)).
0.22/0.50	thf(singleton, axiom, ((singleton)=(^[X1:$i]:(?[X3:$i]:(((in @ X3 @ X1)&((X1)=(setadjoin @ X3 @ emptyset))))))), file('/export/starexec/sandbox/tmp/tmp.anEhpCoJ4D/Vampire---4.8_28359', singleton)).
0.22/0.50	thf(ksndsingleton, axiom, ((ksndsingleton)<=>![X7:$i]:(((iskpair @ X7)=>(singleton @ (dsetconstr @ (setunion @ X7) @ (^[X3:$i]:(((X7)=(kpair @ (kfst @ X7) @ X3))))))))), file('/export/starexec/sandbox/tmp/tmp.anEhpCoJ4D/Vampire---4.8_28359', ksndsingleton)).
0.22/0.50	thf(dsetconstrER, axiom, ((dsetconstrER)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:((X2 @ X4)))))=>(X2 @ X3)))), file('/export/starexec/sandbox/tmp/tmp.anEhpCoJ4D/Vampire---4.8_28359', dsetconstrER)).
0.22/0.50	thf(kpairp, axiom, ((kpairp)<=>![X3:$i, X4:$i]:((iskpair @ (kpair @ X3 @ X4)))), file('/export/starexec/sandbox/tmp/tmp.anEhpCoJ4D/Vampire---4.8_28359', kpairp)).
0.22/0.50	thf(theprop, axiom, ((theprop)<=>![X5:$i]:(((singleton @ X5)=>(in @ (setunion @ X5) @ X5)))), file('/export/starexec/sandbox/tmp/tmp.anEhpCoJ4D/Vampire---4.8_28359', theprop)).
0.22/0.50	thf(ksndpairEq, conjecture, ((dsetconstrER)=>((kpairp)=>((theprop)=>((![X3:$i, X4:$i]:(((ksnd @ (kpair @ X3 @ X4))=(X4)))<=(ksndsingleton))<=(setukpairinjR))))), file('/export/starexec/sandbox/tmp/tmp.anEhpCoJ4D/Vampire---4.8_28359', ksndpairEq)).
0.22/0.50	thf(setukpairinjR, axiom, ((setukpairinjR)<=>![X3:$i, X4:$i, X6:$i, X7:$i]:((((kpair @ X3 @ X4)=(kpair @ X6 @ X7))=>((X4)=(X7))))), file('/export/starexec/sandbox/tmp/tmp.anEhpCoJ4D/Vampire---4.8_28359', setukpairinjR)).
0.22/0.50	thf(kpair, axiom, ((kpair)=(^[X3:$i, X4:$i]:(setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X4 @ emptyset)) @ emptyset)))), file('/export/starexec/sandbox/tmp/tmp.anEhpCoJ4D/Vampire---4.8_28359', kpair)).
0.22/0.50	thf(ksnd, axiom, ((ksnd)=(^[X7:$i]:(setunion @ (dsetconstr @ (setunion @ X7) @ (^[X3:$i]:(((X7)=(kpair @ (kfst @ X7) @ X3)))))))), file('/export/starexec/sandbox/tmp/tmp.anEhpCoJ4D/Vampire---4.8_28359', ksnd)).
0.22/0.50	thf(c_0_10, plain, ((iskpair)=(^[Z0/* 5 */:$i]:(?[X3:$i]:(((in @ X3 @ (setunion @ Z0))&?[X4:$i]:(((in @ X4 @ (setunion @ Z0))&((Z0)=(setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X4 @ emptyset)) @ emptyset)))))))))), inference(fof_simplification,[status(thm)],[iskpair])).
0.22/0.50	thf(c_0_11, plain, ((singleton)=(^[Z0/* 5 */:$i]:(?[X3:$i]:(((in @ X3 @ Z0)&((Z0)=(setadjoin @ X3 @ emptyset))))))), inference(fof_simplification,[status(thm)],[singleton])).
0.22/0.50	thf(c_0_12, plain, ((ksndsingleton)<=>![X7:$i]:(((iskpair @ X7)=>(singleton @ (dsetconstr @ (setunion @ X7) @ (^[Z0/* 3 */:$i]:(((X7)=(kpair @ (kfst @ X7) @ Z0))))))))), inference(fof_simplification,[status(thm)],[ksndsingleton])).
0.22/0.50	thf(c_0_13, plain, ((dsetconstrER)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ (dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:((X2 @ Z0)))))=>(X2 @ X3)))), inference(fof_simplification,[status(thm)],[dsetconstrER])).
0.22/0.50	thf(c_0_14, axiom, ((kpairp)=(![X3:$i, X4:$i]:((?[X21:$i]:(((in @ X21 @ (setunion @ (kpair @ X3 @ X4)))&?[X22:$i]:(((in @ X22 @ (setunion @ (kpair @ X3 @ X4)))&((kpair @ X3 @ X4)=(setadjoin @ (setadjoin @ X21 @ emptyset) @ (setadjoin @ (setadjoin @ X21 @ (setadjoin @ X22 @ emptyset)) @ emptyset))))))))))), inference(apply_def,[status(thm)],[kpairp, c_0_10])).
0.22/0.50	thf(c_0_15, axiom, ((theprop)=(![X5:$i]:(((?[X23:$i]:(((in @ X23 @ X5)&((X5)=(setadjoin @ X23 @ emptyset)))))=>(in @ (setunion @ X5) @ X5))))), inference(apply_def,[status(thm)],[theprop, c_0_11])).
0.22/0.50	thf(c_0_16, plain, ((ksndsingleton)=(![X7:$i]:(((?[X24:$i]:(((in @ X24 @ (setunion @ X7))&?[X25:$i]:(((in @ X25 @ (setunion @ X7))&((X7)=(setadjoin @ (setadjoin @ X24 @ emptyset) @ (setadjoin @ (setadjoin @ X24 @ (setadjoin @ X25 @ emptyset)) @ emptyset))))))))=>(?[X26:$i]:(((in @ X26 @ (dsetconstr @ (setunion @ X7) @ (^[Z0/* 3 */:$i]:(((X7)=(kpair @ (kfst @ X7) @ Z0))))))&((dsetconstr @ (setunion @ X7) @ (^[Z0/* 3 */:$i]:(((X7)=(kpair @ (kfst @ X7) @ Z0)))))=(setadjoin @ X26 @ emptyset))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12, c_0_10]), c_0_11])).
0.22/0.50	thf(c_0_17, negated_conjecture, ~((![X27:$i, X28:$i > $o, X29:$i]:(((in @ X29 @ (dsetconstr @ X27 @ (^[Z0/* 3 */:$i]:((X28 @ Z0)))))=>(X28 @ X29)))=>(![X30:$i, X31:$i]:(?[X32:$i]:(((in @ X32 @ (setunion @ (kpair @ X30 @ X31)))&?[X33:$i]:(((in @ X33 @ (setunion @ (kpair @ X30 @ X31)))&((kpair @ X30 @ X31)=(setadjoin @ (setadjoin @ X32 @ emptyset) @ (setadjoin @ (setadjoin @ X32 @ (setadjoin @ X33 @ emptyset)) @ emptyset))))))))=>(![X34:$i]:((?[X35:$i]:(((in @ X35 @ X34)&((X34)=(setadjoin @ X35 @ emptyset))))=>(in @ (setunion @ X34) @ X34)))=>(![X40:$i, X41:$i, X42:$i, X43:$i]:((((kpair @ X40 @ X41)=(kpair @ X42 @ X43))=>((X41)=(X43))))=>(![X36:$i]:((?[X37:$i]:(((in @ X37 @ (setunion @ X36))&?[X38:$i]:(((in @ X38 @ (setunion @ X36))&((X36)=(setadjoin @ (setadjoin @ X37 @ emptyset) @ (setadjoin @ (setadjoin @ X37 @ (setadjoin @ X38 @ emptyset)) @ emptyset)))))))=>?[X39:$i]:(((in @ X39 @ (dsetconstr @ (setunion @ X36) @ (^[Z0/* 3 */:$i]:(((X36)=(kpair @ (kfst @ X36) @ Z0))))))&((dsetconstr @ (setunion @ X36) @ (^[Z0/* 3 */:$i]:(((X36)=(kpair @ (kfst @ X36) @ Z0)))))=(setadjoin @ X39 @ emptyset))))))=>![X3:$i, X4:$i]:(((ksnd @ (kpair @ X3 @ X4))=(X4))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[ksndpairEq]), c_0_13]), c_0_14]), c_0_15]), setukpairinjR]), c_0_16])])).
0.22/0.50	thf(c_0_18, plain, ![X44:$i, X45:$i]:(((kpair @ X44 @ X45)=(setadjoin @ (setadjoin @ X44 @ emptyset) @ (setadjoin @ (setadjoin @ X44 @ (setadjoin @ X45 @ emptyset)) @ emptyset)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[kpair])])).
0.22/0.50	thf(c_0_19, negated_conjecture, ![X50:$i, X51:$i > $o, X52:$i, X53:$i, X54:$i, X57:$i, X58:$i, X59:$i, X60:$i, X61:$i, X62:$i, X63:$i, X64:$i, X65:$i]:(((~(in @ X52 @ (dsetconstr @ X50 @ (^[Z0/* 3 */:$i]:((X51 @ Z0)))))|(X51 @ X52))&(((in @ (esk1_2 @ X53 @ X54) @ (setunion @ (kpair @ X53 @ X54)))&((in @ (esk2_2 @ X53 @ X54) @ (setunion @ (kpair @ X53 @ X54)))&((kpair @ X53 @ X54)=(setadjoin @ (setadjoin @ (esk1_2 @ X53 @ X54) @ emptyset) @ (setadjoin @ (setadjoin @ (esk1_2 @ X53 @ X54) @ (setadjoin @ (esk2_2 @ X53 @ X54) @ emptyset)) @ emptyset)))))&((~(in @ X58 @ X57)|((X57)!=(setadjoin @ X58 @ emptyset))|(in @ (setunion @ X57) @ X57))&((((kpair @ X59 @ X60)!=(kpair @ X61 @ X62))|((X60)=(X62)))&((((in @ (esk3_1 @ X63) @ (dsetconstr @ (setunion @ X63) @ (^[Z0/* 3 */:$i]:(((X63)=(kpair @ (kfst @ X63) @ Z0))))))|(~(in @ X64 @ (setunion @ X63))|(~(in @ X65 @ (setunion @ X63))|((X63)!=(setadjoin @ (setadjoin @ X64 @ emptyset) @ (setadjoin @ (setadjoin @ X64 @ (setadjoin @ X65 @ emptyset)) @ emptyset))))))&(((dsetconstr @ (setunion @ X63) @ (^[Z0/* 3 */:$i]:(((X63)=(kpair @ (kfst @ X63) @ Z0)))))=(setadjoin @ (esk3_1 @ X63) @ emptyset))|(~(in @ X64 @ (setunion @ X63))|(~(in @ X65 @ (setunion @ X63))|((X63)!=(setadjoin @ (setadjoin @ X64 @ emptyset) @ (setadjoin @ (setadjoin @ X64 @ (setadjoin @ X65 @ emptyset)) @ emptyset)))))))&((ksnd @ (kpair @ esk4_0 @ esk5_0))!=(esk5_0)))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])])).
0.22/0.50	thf(c_0_20, plain, ![X47:$i, X48:$i]:(((kpair @ X47 @ X48)=(setadjoin @ (setadjoin @ X47 @ emptyset) @ (setadjoin @ (setadjoin @ X47 @ (setadjoin @ X48 @ emptyset)) @ emptyset)))), inference(variable_rename,[status(thm)],[c_0_18])).
0.22/0.50	thf(c_0_21, negated_conjecture, ![X1:$i, X3:$i]:(((kpair @ X1 @ X3)=(setadjoin @ (setadjoin @ (esk1_2 @ X1 @ X3) @ emptyset) @ (setadjoin @ (setadjoin @ (esk1_2 @ X1 @ X3) @ (setadjoin @ (esk2_2 @ X1 @ X3) @ emptyset)) @ emptyset)))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.22/0.50	thf(c_0_22, plain, ![X1:$i, X3:$i]:(((kpair @ X1 @ X3)=(setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.22/0.50	thf(c_0_23, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:((((X3)=(X5))|((kpair @ X1 @ X3)!=(kpair @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.22/0.50	thf(c_0_24, negated_conjecture, ![X1:$i, X3:$i]:(((kpair @ (esk1_2 @ X1 @ X3) @ (esk2_2 @ X1 @ X3))=(kpair @ X1 @ X3))), inference(rw,[status(thm)],[c_0_21, c_0_22])).
0.22/0.50	thf(c_0_25, plain, ![X69:$i, X1:$i]:(((epred1_1 @ X1 @ X69)<=>((X1)=(kpair @ (kfst @ X1) @ X69)))), introduced(definition)).
0.22/0.50	thf(c_0_26, negated_conjecture, ![X1:$i, X3:$i, X5:$i, X4:$i]:((((esk2_2 @ X1 @ X3)=(X4))|((kpair @ X1 @ X3)!=(kpair @ X5 @ X4)))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
0.22/0.50	thf(c_0_27, negated_conjecture, ![X1:$i, X3:$i, X4:$i]:((((dsetconstr @ (setunion @ X1) @ (epred1_1 @ X1))=(setadjoin @ (esk3_1 @ X1) @ emptyset))|~((in @ X3 @ (setunion @ X1)))|~((in @ X4 @ (setunion @ X1)))|((X1)!=(setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X4 @ emptyset)) @ emptyset))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_19]), c_0_25])).
0.22/0.50	thf(c_0_28, negated_conjecture, ![X1:$i, X3:$i]:((in @ (esk2_2 @ X1 @ X3) @ (setunion @ (kpair @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.22/0.50	thf(c_0_29, negated_conjecture, ![X1:$i, X3:$i]:(((esk2_2 @ X1 @ X3)=(X3))), inference(er,[status(thm)],[c_0_26])).
0.22/0.50	thf(c_0_30, plain, ![X46:$i]:(((ksnd @ X46)=(setunion @ (dsetconstr @ (setunion @ X46) @ (^[Z0/* 3 */:$i]:(((X46)=(kpair @ (kfst @ X46) @ Z0)))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[ksnd])])).
0.22/0.50	thf(c_0_31, negated_conjecture, ![X1:$i, X3:$i]:((((dsetconstr @ (setunion @ (kpair @ X1 @ X3)) @ (epred1_1 @ (kpair @ X1 @ X3)))=(setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset))|~((in @ X3 @ (setunion @ (kpair @ X1 @ X3))))|~((in @ X1 @ (setunion @ (kpair @ X1 @ X3)))))), inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_22])])).
0.22/0.50	thf(c_0_32, negated_conjecture, ![X3:$i, X1:$i]:((in @ X1 @ (setunion @ (kpair @ X3 @ X1)))), inference(rw,[status(thm)],[c_0_28, c_0_29])).
0.22/0.50	thf(c_0_33, plain, ![X49:$i]:(((ksnd @ X49)=(setunion @ (dsetconstr @ (setunion @ X49) @ (^[Z0/* 3 */:$i]:(((X49)=(kpair @ (kfst @ X49) @ Z0)))))))), inference(variable_rename,[status(thm)],[c_0_30])).
0.22/0.50	thf(c_0_34, negated_conjecture, ![X1:$i, X3:$i, X4:$i]:(((((in @ (esk3_1 @ X1) @ (dsetconstr @ (setunion @ X1) @ (epred1_1 @ X1))))=(($true)))|~((in @ X3 @ (setunion @ X1)))|~((in @ X4 @ (setunion @ X1)))|((X1)!=(setadjoin @ (setadjoin @ X3 @ emptyset) @ (setadjoin @ (setadjoin @ X3 @ (setadjoin @ X4 @ emptyset)) @ emptyset))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_19]), c_0_25])).
0.22/0.50	thf(c_0_35, negated_conjecture, ![X1:$i, X3:$i]:((((dsetconstr @ (setunion @ (kpair @ X1 @ X3)) @ (epred1_1 @ (kpair @ X1 @ X3)))=(setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset))|~((in @ X1 @ (setunion @ (kpair @ X1 @ X3)))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_32])])).
0.22/0.50	thf(c_0_36, negated_conjecture, ![X1:$i, X3:$i]:(((kpair @ (esk1_2 @ X1 @ X3) @ X3)=(kpair @ X1 @ X3))), inference(rw,[status(thm)],[c_0_24, c_0_29])).
0.22/0.50	thf(c_0_37, negated_conjecture, ![X1:$i, X3:$i]:((in @ (esk1_2 @ X1 @ X3) @ (setunion @ (kpair @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.22/0.50	thf(c_0_38, plain, ![X1:$i]:(((ksnd @ X1)=(setunion @ (dsetconstr @ (setunion @ X1) @ (epred1_1 @ X1))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_33]), c_0_25])).
0.22/0.50	thf(c_0_39, negated_conjecture, ![X1:$i, X3:$i]:(((in @ (esk3_1 @ (kpair @ X1 @ X3)) @ (dsetconstr @ (setunion @ (kpair @ X1 @ X3)) @ (epred1_1 @ (kpair @ X1 @ X3))))|~((in @ X3 @ (setunion @ (kpair @ X1 @ X3))))|~((in @ X1 @ (setunion @ (kpair @ X1 @ X3)))))), inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[c_0_34]), c_0_22])])).
0.22/0.50	thf(c_0_40, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(((X2 @ X1)|~((in @ X1 @ (dsetconstr @ X3 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.22/0.50	thf(c_0_41, negated_conjecture, ![X1:$i, X3:$i]:(((dsetconstr @ (setunion @ (kpair @ X1 @ X3)) @ (epred1_1 @ (kpair @ X1 @ X3)))=(setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_37])])).
0.22/0.50	thf(c_0_42, negated_conjecture, ![X3:$i, X1:$i]:(((in @ (setunion @ X3) @ X3)|~((in @ X1 @ X3))|((X3)!=(setadjoin @ X1 @ emptyset)))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.22/0.50	thf(c_0_43, negated_conjecture, ![X1:$i, X3:$i]:((((setunion @ (setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset))=(ksnd @ (kpair @ X1 @ X3)))|~((in @ X1 @ (setunion @ (kpair @ X1 @ X3)))))), inference(spm,[status(thm)],[c_0_38, c_0_35])).
0.22/0.50	thf(c_0_44, negated_conjecture, ![X1:$i, X3:$i]:(((in @ (esk3_1 @ (kpair @ X1 @ X3)) @ (dsetconstr @ (setunion @ (kpair @ X1 @ X3)) @ (epred1_1 @ (kpair @ X1 @ X3))))|~((in @ X1 @ (setunion @ (kpair @ X1 @ X3)))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39, c_0_32])])).
0.22/0.50	thf(c_0_45, plain, ![X72:$i, X73:$i]:(((~(epred1_1 @ X73 @ X72)|((X73)=(kpair @ (kfst @ X73) @ X72)))&(((X73)!=(kpair @ (kfst @ X73) @ X72))|(epred1_1 @ X73 @ X72)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])).
0.22/0.50	thf(c_0_46, negated_conjecture, ![X1:$i, X4:$i, X3:$i]:(((epred1_1 @ (kpair @ X1 @ X3) @ X4)|~((in @ X4 @ (setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset))))), inference(spm,[status(thm)],[c_0_40, c_0_41])).
0.22/0.50	thf(c_0_47, negated_conjecture, ![X1:$i]:(((in @ (setunion @ (setadjoin @ X1 @ emptyset)) @ (setadjoin @ X1 @ emptyset))|~((in @ X1 @ (setadjoin @ X1 @ emptyset))))), inference(er,[status(thm)],[c_0_42])).
0.22/0.50	thf(c_0_48, negated_conjecture, ![X1:$i, X3:$i]:(((setunion @ (setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset))=(ksnd @ (kpair @ X1 @ X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_36]), c_0_37])])).
0.22/0.50	thf(c_0_49, negated_conjecture, ![X1:$i, X3:$i]:(((in @ (esk3_1 @ (kpair @ X1 @ X3)) @ (setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset))|~((in @ X1 @ (setunion @ (kpair @ X1 @ X3)))))), inference(rw,[status(thm)],[c_0_44, c_0_41])).
0.22/0.50	thf(c_0_50, plain, ![X1:$i, X3:$i]:((((X1)=(kpair @ (kfst @ X1) @ X3))|~((epred1_1 @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_45])).
0.22/0.50	thf(c_0_51, negated_conjecture, ![X1:$i, X3:$i]:(((epred1_1 @ (kpair @ X1 @ X3) @ (ksnd @ (kpair @ X1 @ X3)))|~((in @ (esk3_1 @ (kpair @ X1 @ X3)) @ (setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset))))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46, c_0_47]), c_0_48])).
0.22/0.50	thf(c_0_52, negated_conjecture, ![X1:$i, X3:$i]:((in @ (esk3_1 @ (kpair @ X1 @ X3)) @ (setadjoin @ (esk3_1 @ (kpair @ X1 @ X3)) @ emptyset))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_36]), c_0_37])])).
0.22/0.50	thf(c_0_53, negated_conjecture, ![X4:$i, X3:$i, X1:$i]:((((X1)=(X3))|~((epred1_1 @ (kpair @ X4 @ X3) @ X1)))), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_50])])).
0.22/0.50	thf(c_0_54, negated_conjecture, ![X1:$i, X3:$i]:((epred1_1 @ (kpair @ X1 @ X3) @ (ksnd @ (kpair @ X1 @ X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51, c_0_52])])).
0.22/0.50	thf(c_0_55, negated_conjecture, ((ksnd @ (kpair @ esk4_0 @ esk5_0))!=(esk5_0)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.22/0.50	thf(c_0_56, negated_conjecture, ![X1:$i, X3:$i]:(((ksnd @ (kpair @ X1 @ X3))=(X3))), inference(spm,[status(thm)],[c_0_53, c_0_54])).
0.22/0.50	thf(c_0_57, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55, c_0_56])]), ['proof']).
0.22/0.50	# SZS output end CNFRefutation
0.22/0.50	# Parsed axioms                        : 25
0.22/0.50	# Removed by relevancy pruning/SinE    : 0
0.22/0.50	# Initial clauses                      : 28
0.22/0.50	# Removed in clause preprocessing      : 15
0.22/0.50	# Initial clauses in saturation        : 13
0.22/0.50	# Processed clauses                    : 79
0.22/0.50	# ...of these trivial                  : 0
0.22/0.50	# ...subsumed                          : 15
0.22/0.50	# ...remaining for further processing  : 64
0.22/0.50	# Other redundant clauses eliminated   : 7
0.22/0.50	# Clauses deleted for lack of memory   : 0
0.22/0.50	# Backward-subsumed                    : 4
0.22/0.50	# Backward-rewritten                   : 11
0.22/0.50	# Generated clauses                    : 132
0.22/0.50	# ...of the previous two non-redundant : 117
0.22/0.50	# ...aggressively subsumed             : 0
0.22/0.50	# Contextual simplify-reflections      : 0
0.22/0.50	# Paramodulations                      : 123
0.22/0.50	# Factorizations                       : 0
0.22/0.50	# NegExts                              : 0
0.22/0.50	# Equation resolutions                 : 9
0.22/0.50	# Total rewrite steps                  : 42
0.22/0.50	# Propositional unsat checks           : 0
0.22/0.50	#    Propositional check models        : 0
0.22/0.50	#    Propositional check unsatisfiable : 0
0.22/0.50	#    Propositional clauses             : 0
0.22/0.50	#    Propositional clauses after purity: 0
0.22/0.50	#    Propositional unsat core size     : 0
0.22/0.50	#    Propositional preprocessing time  : 0.000
0.22/0.50	#    Propositional encoding time       : 0.000
0.22/0.50	#    Propositional solver time         : 0.000
0.22/0.50	#    Success case prop preproc time    : 0.000
0.22/0.50	#    Success case prop encoding time   : 0.000
0.22/0.50	#    Success case prop solver time     : 0.000
0.22/0.50	# Current number of processed clauses  : 33
0.22/0.50	#    Positive orientable unit clauses  : 12
0.22/0.50	#    Positive unorientable unit clauses: 0
0.22/0.50	#    Negative unit clauses             : 0
0.22/0.50	#    Non-unit-clauses                  : 21
0.22/0.50	# Current number of unprocessed clauses: 44
0.22/0.50	# ...number of literals in the above   : 80
0.22/0.50	# Current number of archived formulas  : 0
0.22/0.50	# Current number of archived clauses   : 28
0.22/0.50	# Clause-clause subsumption calls (NU) : 152
0.22/0.50	# Rec. Clause-clause subsumption calls : 148
0.22/0.50	# Non-unit clause-clause subsumptions  : 18
0.22/0.50	# Unit Clause-clause subsumption calls : 5
0.22/0.50	# Rewrite failures with RHS unbound    : 0
0.22/0.50	# BW rewrite match attempts            : 9
0.22/0.50	# BW rewrite match successes           : 8
0.22/0.50	# Condensation attempts                : 81
0.22/0.50	# Condensation successes               : 1
0.22/0.50	# Termbank termtop insertions          : 6462
0.22/0.50	
0.22/0.50	# -------------------------------------------------
0.22/0.50	# User time                : 0.013 s
0.22/0.50	# System time              : 0.002 s
0.22/0.50	# Total time               : 0.015 s
0.22/0.50	# Maximum resident set size: 1988 pages
0.22/0.51	
0.22/0.51	# -------------------------------------------------
0.22/0.51	# User time                : 0.046 s
0.22/0.51	# System time              : 0.014 s
0.22/0.51	# Total time               : 0.060 s
0.22/0.51	# Maximum resident set size: 1728 pages
0.22/0.51	% E---3.1 exiting
0.22/0.51	EOF